Exploiting Commutativity For Practical Fast Replication
نویسندگان
چکیده
Traditional approaches to replication require client requests to be ordered before making them durable by copying them to replicas. As a result, clients must wait for two round-trip times (RTTs) before updates complete. In this paper, we show that this entanglement of ordering and durability is unnecessary for strong consistency. Consistent Unordered Replication Protocol (CURP) allows clients to replicate requests that have not yet been ordered, as long as they are commutative. This strategy allows most operations to complete in 1 RTT (the same as an unreplicated system). We implemented CURP in the Redis and RAMCloud storage systems. In RAMCloud, CURP improved write latency by∼2x (13.8μs→ 7.3μs) and write throughput by 4x. Compared to unreplicated RAMCloud, CURP’s latency overhead for 3-way replication is just 0.4 μs (6.9 μs vs 7.3 μs). CURP transformed a non-durable Redis cache into a consistent and durable storage system with only a small performance overhead.
منابع مشابه
Maximally Fast and Arbitrarily Fast Hardware Efficient Implementation of Linear and Feedback Linear Computations1
By establishing a relationship between the basic properties of linear computations (additivity and homogeneity) and eight optimizing transformations (distributivity, associativity, commutativity, inverse and zero element law, common subexpression replication and elimination and constant propagation), a CAD platform is developed to optimally speed-up an arbitrary instance from this large class o...
متن کاملCommutativity degree of $mathbb{Z}_p$≀$mathbb{Z}_{p^n}
For a nite group G the commutativity degree denote by d(G) and dend:$$d(G) =frac{|{(x; y)|x, yin G,xy = yx}|}{|G|^2}.$$ In [2] authors found commutativity degree for some groups,in this paper we nd commutativity degree for a class of groups that have high nilpontencies.
متن کاملFinite groups with three relative commutativity degrees
For a finite group $G$ and a subgroup $H$ of $G$, the relative commutativity degree of $H$ in $G$, denoted by $d(H,G)$, is the probability that an element of $H$ commutes with an element of $G$. Let $mathcal{D}(G)={d(H,G):Hleq G}$ be the set of all relative commutativity degrees of subgroups of $G$. It is shown that a finite group $G$ admits three relative commutativity degrees if a...
متن کاملThe Tensor Degree of a Pair of Finite Groups
In this paper, we study the tensor commutativity degree of pair of finite groups. Erdos introduced the relative commutativity degree and studied its properties. Then, Mr. Niroomand introduced the tensor relative commutativity degree, calculated tensor relative degree for some groups, and studied its properties. Also, he explained its relation with relative commutativity degree. In this paper, w...
متن کاملA GENERALIZATION OF A JACOBSON’S COMMUTATIVITY THEOREM
In this paper we study the structure and the commutativity of a ring R, in which for each x,y ? R, there exist two integers depending on x,y such that [x,y]k equals x n or y n.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- CoRR
دوره abs/1710.09921 شماره
صفحات -
تاریخ انتشار 2017